Chebyshev diagrams for two-bridge knots

نویسندگان

  • Pierre-Vincent Koseleff
  • Daniel Pecker
  • D. Pecker
چکیده

We show that every two-bridge knot K of crossing number N admits a polynomial parametrization x = T3(t), y = Tb(t), z = C(t) where Tk(t) are the Chebyshev polynomials and b + degC = 3N . If C(t) = Tc(t) is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic knots for a ≤ 3. Most results are derived from continued fractions and their matrix representations. keywords: Polynomial curves, Chebyshev polynomials, Chebyshev curves, rational knots, continued fractions Mathematics Subject Classification 2000: 14H50, 57M25, 14P99

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The first rational Chebyshev knots

A Chebyshev knot C(a, b, c, φ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + φ), where a, b, c are integers, Tn(t) is the Chebyshev polynomial of degree n and φ ∈ R. We show that any two-bridge knot is a Chebyshev knot with a = 3 and also with a = 4. For every a, b, c integers (a = 3, 4 and a, b coprime), we describe an algorithm that gives all Cheb...

متن کامل

Chebyshev diagrams for rational knots

We show that every rational knot K of crossing number N admits a polynomial parametrization x = Ta(t), y = Tb(t), z = C(t) where Tk(t) are the Chebyshev polynomials, a = 3 and b + degC = 3N. We show that every rational knot also admits a polynomial parametrization with a = 4. If C(t) = Tc(t) is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic k...

متن کامل

Computing Chebyshev knot diagrams

A Chebyshev curve C(a, b, c, φ) has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + φ), where a, b, c are integers, Tn(t) is the Chebyshev polynomial of degree n and φ ∈ R. When C(a, b, c, φ) is nonsingular, it defines a polynomial knot. We determine all possible knot diagrams when φ varies. Let a, b, c be integers, a is odd, (a, b) = 1, we show that one can list all pos...

متن کامل

Complexity, Heegaard Diagrams and Generalized Dunwoody Manifolds

We deal with Matveev complexity of compact orientable 3-manifolds represented via Heegaard diagrams. This lead us to the definition of modified Heegaard complexity of Heegaard diagrams and of manifolds. We define a class of manifolds which are generalizations of Dunwoody manifolds, including cyclic branched coverings of two-bridge knots and links, torus knots, some pretzel knots, and some theta...

متن کامل

Ascending Number of Knots and Links

We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009